Reversible and Controllable Nanolocomotion of an RNA-Processing Machinery

نویسندگان

  • Gwangrog Lee
  • Sophia Hartung
  • Karl-Peter Hopfner
  • Taekjip Ha
چکیده

Molecular motors have inspired many avenues of research for nanotechnology but most molecular motors studied so far allow only unidirectional movement. The archaeal RNA-exosome is a reversible motor that can either polymerize or degrade an RNA strand, depending on the chemical environments. We developed a single molecule fluorescence assay to analyze the real time locomotion of this nanomachine on RNA. Despite the multimeric structure, the enzyme followed the Michaelis-Menten kinetics with the maximum speed of ∼3 nucleotides/s, showing that the three catalytic cylinders do not fire cooperatively. We also demonstrate rapid directional switching on demand by fluidic control. When the two reaction speeds are balanced on average, the enzyme shows a memory of the previous reaction it catalyzed and stochastically switches between primarily polymerizing and primarily degrading behaviors. The processive, reversible, and controllable locomotion propelled by this nanomachine has a promising potential in environmental sensing, diagnostic, and cargo delivery applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correction to Reversible and Controllable Nanolocomotion of an RNA-Processing Machinery

O ne of the funding sources was omitted inadvertently. The acknowledgment section should include the statement "

متن کامل

A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing

In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...

متن کامل

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

متن کامل

Building a Multi-Objective Model for Multi-Product Multi-Period Production Planning with Controllable Processing Times: A Real Case Problem

Model building is a fragile and complex process especially in the context of real cases. Each real case problem has its own characteristics with new concepts and conditions. A correct model should have some essential characteristics such as: being compatible with real conditions, being of sufficient accuracy, being logically traceable and etc. This paper discusses how to build an efficient mode...

متن کامل

A Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms

Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this res...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2010